Minimum total distance clustering and balanced distance clustering in northern Thailand's corn crop residue management system
نویسندگان
چکیده
منابع مشابه
Remarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملRelational Distance-Based Clustering
Work on rst-order clustering has primarily been focused on the task of conceptual clustering, i.e., forming clusters with symbolic generalizations in the given representation language. By contrast, for propositional representations, experience has shown that simple algorithms based exclusively on distance measures can often outperform their concept-based counterparts. In this paper, we therefor...
متن کاملApplication of n-distance balanced graphs in distributing management and finding optimal logistical hubs
Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...
متن کاملEfficient Clustering Earth Mover's Distance
The two-class clustering problem is formulated as an integer convex optimisation problem which determines the maximum of the Earth Movers Distance (EMD) between two classes, constructing a bipartite graph with minimum flow and maximum inter-class EMD between two sets. Subsequently including the nearest neighbours of the start point in feature space and calculating the EMD for this labellings qu...
متن کاملHierarchical Distance-Based Conceptual Clustering
In this work we analyse the relation between hierarchical distancebased clustering and the concepts that can be obtained from the hierarchy by generalisation. Many inconsistencies may arise, because the distance and the conceptual generalisation operator are usually incompatible. To overcome this, we propose an algorithm which integrates distance-based and conceptual clustering. The new dendrog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4open
سال: 2019
ISSN: 2557-0250
DOI: 10.1051/fopen/2019008